An optimal algorithm to generate tilings
نویسندگان
چکیده
منابع مشابه
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input. We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston’s algorithm for constructing a particular tiling. We then describe our algorithm and study its...
متن کاملAn optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of edges incident to to a same vertex. A rooted trivalent diagram is a trivalent diagram with a distinguished edge, its root. We shall describe and analyze an a...
متن کاملAn Optimal Algorithm to Generate Pointed Trivalent Diagrams and Pointed Triangular Maps
A trivalent diagram is a connected graph with cyclic orientations and degree conditions on its vertices. It is the combinatorial description of an unembedded trivalent ribbon graph. We shall describe and analyze an algorithm giving an exhaustive list of trivalent diagrams of a given size. The list being nonredundant in that no two diagrams of the list are isomorphic. The algorithm will be shown...
متن کاملAn Algorithm to Generate Canonical Transformations: Application to Normal Forms
We describe a new method to generate symplectic diieomorphisms. This method is based on primitive functions, and it was introduced in 24]. We apply the algorithm to the construction of normal forms of KAM tori. A concrete application, developed in detail and implemented numerically, is normal forms near invariant circles.
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2006
ISSN: 1570-8667
DOI: 10.1016/j.jda.2005.01.003